package niuke;

import java.util.Scanner;


public class tt {
	
    public static void main(String[] args){
        int n,m;
        Scanner scanner = new Scanner(System.in);
        n = scanner.nextInt();
        m = scanner.nextInt();
        int[] numbers = new int[n];
        for(int i=0;i<n;i++){
        	numbers[i] = scanner.nextInt();
        }
        
        boolean[] hit = new boolean[m];
        boolean[] hitCopy = new boolean[m];
        hit[0] = true;
        
        for(int i=0;i<n;i++){
        	for(int j=0;j<m;j++){//j为每个可能的余数
        		if(hit[j]){
        			int newHit = (numbers[i]+j)%m;
        			if(newHit==0){
        				System.out.println("Yes");
        				return;
        			}else{
        				hitCopy[newHit] = true;
        				hitCopy[j] = true;
        			}
        		}
        	}
        	hit = hitCopy;
        	hitCopy = new boolean[m];
        }
        System.out.println("No");
        scanner.close();
    }
	
}
